1 Business Processes
Note: Dataset links in supplemental materials are broken. After contacting the author, they mentioned that the other datasets were internal and could not be shared. Origin Notes: The Origin Paper collects various graphs from a few of sources. Some of these datasets are from international business process intelligence challenges, and others are specific processes from companies in a certain domain (hospital, road traffic management, pay processes, etc.). graph features handled: Labeled nodes, N-layers Graph features in papers: labeled nodes,layered graphs,n-layers Origin Paper: A Stable Graph Layout Algorithm for Processes (https://www.notion.so/A-Stable-Graph-Layout-Algorithm-for-Processes-35d585a25b63442b89c4977095ec923f?pvs=21) Originally found at: https://robinmennens.github.io/Portfolio/stableprocessgraphs.html Size: 13 graphs from 11 to 50 nodes and up to 772 edges Number of Graphs: 0 Appeared in years: 2019 Type of Collection: Lost/Unavailable is it stored properly?: No must be analyzed: No In repo?: No cleaned format?: No duplicate?: No link works?: No Added in paper: No Origin paper plaintext: A Stable Graph Layout Algorithm for Processes Page id: 9d09430927704fcf8fdf1ee4e00cabbc unavailable/skip: Yes Cleaned ALL data: No first look: Yes Related to Literature - Algorithm (Dataset tag relations) 1: A stable graph layout algorithm for processes (../Benchmark%20sets%200cc6b5e454304aec98f3b59b1a720476/Literature%20ad87f14e7097454fb2f784e2c8a2797a/Literature%20-%20Algorithm%2012e01bfc60a84007aa7d2d34293e123d/A%20stable%20graph%20layout%20algorithm%20for%20processes%20c1a2e3baaf814eb7b38e3f4e8a553471.md)
2 Body
Description From Literature
From A stable graph layout algorithm for processes:
We use 13 datasets (see supplementary material), which represent real-world processes. For every dataset, we ran 500 tests on both methods. Each test involved a pair of randomly generated graphs \(G_1, G_2 \subseteq \bar{G}\) , which were obtained by randomly removing a subset of the edges \(\bar{E}\) and then removing all nodes \(n \in \bar{V}\) that became disconnected. Consequently, \(G_1\) and \(G_2\) are random sub-graphs of \(\bar{G}\) .
Table from Supplementary Materials:
Example Figures
From A stable graph layout algorithm for processes:
== STOP RENDERING ==
“Hi! Thanks for reaching out! The dataset used is an internal one that I cannot share unfortunately. Some other datasets were public datasets and I think I did include urls in my references”
-urls are broken